Finite Automata
Q32.
Let w be any string of length n in {0, 1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?Q33.
A deterministic finite automation (DFA)D with alphabet \Sigma= {a,b} is given below Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?Q36.
Definition of a language L with alphabet {a} is given as following L={a^{nk} |k > 0, and n is a positive integer constant} What is the minimum number of states needed in a DFA to recognize L?Q37.
Given the following state table of an FSM with two states A and B, one input and one output: If the initial state is A = 0, B=0, what is the minimum length of an input string which will take the machine to the state A=0, B=1 with Output=1?Q38.
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet {a,b} will be accepted by the new DFA?Q39.
Let N be an NFA with n states and let M be the minimized DFA with m states recognizing the same language. Which of the following in NECESSARILY true?Q40.
Consider the following finite automata P and Q over the alphabet {a, b, c}. The start states are indicated by a double arrow and final states are indicated by a double circle. Let the languages recognized by them be denoted by L(P) and L(Q) respectively.The automation which recognizes the language L(P)\capL(Q) is :